Analysis of the Random Walk Algorithm on Random -CNFs
نویسندگان
چکیده
We analyze the efficiency of the random walk algorithm on random -CNF instances, and prove the first polynomial time upper bound for small clause density, less than . We complement this by proving exponential lower bounds for the running time of this algorithm on the planted-SAT distribution with large constant clause density. This is the first polynomial upper bound on the running time of a local improvement algorithm on random instances, and conforms with the empirically observed efficiency of these algorithms on random CNFs.
منابع مشابه
Pushing Random Walk Beyond Golden Ratio
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. We rigorously prove that the new algorithm solves the Full CNF with high probability, and for random CNFs with a planted solution of high density finds an assignment that differs from the planted in only ε-fraction of v...
متن کاملEfficient and Robust Query Processing for Mobile Wireless Sensor Networks
We present CNFS, an algorithm for efficient and robust query processing for mobile wireless sensor networks. CNFS is a walk–based algorithm that is biased to visit nodes close to the source first. This bias is accomplished by collecting topology information about the network as the search progresses. This information is also used to tolerate changes in the network topology caused by node mobili...
متن کاملA survey on random walk-based stochastic modeling in eukaryotic cell migration with emphasis on its application in cancer
Impairments in cell migration processes may cause various diseases, among which cancer cell metastasis, tumor angiogenesis, and the disability of immune cells to infiltrate into tumors are prominent ones. Mathematical modeling has been widely used to analyze the cell migration process. Cell migration is a complicated process and requires statistical methods such as random walk for proper analys...
متن کاملA survey on random walk-based stochastic modeling in eukaryotic cell migration with emphasis on its application in cancer
Impairments in cell migration processes may cause various diseases, among which cancer cell metastasis, tumor angiogenesis, and the disability of immune cells to infiltrate into tumors are prominent ones. Mathematical modeling has been widely used to analyze the cell migration process. Cell migration is a complicated process and requires statistical methods such as random walk for proper analys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002